On a conjecture about relative lengths
نویسندگان
چکیده
We need some definitions from [1]. Let C ⊂ R2 be a convex body. A chord pq of C is called an affine diameter of C, if there is no longer parallel chord in C. The ratio of |ab| to 1 2 |a′b′|, where a′b′ is an affine diameter of C parallel to ab, is called the C-length of ab, or the relative length of ab, if there is no doubt about C. We denote it by λC(ab). Denote by λn the relative length of a side of the regular n-gon. For every ab ⊂ C we have |ab| ≤ |a′b′|, where a′b′ is the affine diameter parallel to ab, hence 0 < λn = |ab| |a′b′|/2 ≤ 2. For every regular triangle (or square), since its side length equals its corresponding affine diameter, λ3 = λ4 = 2. Let C = abcde be a regular pentagon with side length 1, join the points c and e, then we know that ab is parallel to ce and λ5 = λC(ab) = |ab| |ce|/2 = 1/ cos(π5 ) = √ 5 − 1 (see Fig. 1). Let C = abcdef be a regular hexagon with side length 1, join the points c and f , then ab is parallel to c f and λ6 = |ab| |c f |/2 = 1 (see Fig. 2). A side ab of a convex n-gon P is called relatively short if λP (ab) ≤ λn , and it is called relatively long if λP (ab) ≥ λn .
منابع مشابه
Kemnitz' conjecture revisited
A conjecture of Kemnitz remained open for some 20 years: each sequence of 4n−3 lattice points in the plane has a subsequence of length nwhose centroid is a lattice point. It was solved independently by Reiher and di Fiore in the autumn of 2003.A refined and more general version of Kemnitz’ conjecture is proved in this note. The main result is about sequences of lengths between 3p−2 and 4p−3 in ...
متن کامل-Conjecture for Fix-Free Codes
A fix-free code is a code, which is prefix-free and suffix-free, i.e. any codeword of a fix-free code is neither a prefix, nor a suffix of another codeword. Fix-free codes were first introduced by Schützenberg (4) and Gilbert and Moore (5), where they were called never-self-synchronizing codes. Ahlswede, Balkenhol and Khachatrian propose in (6) the conjecture that a Kraftsum of a lengths sequen...
متن کاملGreedy palindromic lengths
In [A. Frid, S. Puzynina, L.Q. Zamboni, On palindromic factorization of words, Adv. in Appl. Math. 50 (2013), 737-748], it was conjectured that any infinite word whose palindromic lengths of factors are bounded is ultimately periodic. We introduce variants of this conjecture and prove this conjecture in particular cases. Especially we introduce left and right greedy palindromic lengths. These l...
متن کاملMinimum degree and even cycle lengths
A classic result of Dirac states that if G is a 2-connected graph of order n with minimum degree δ ≥ 3, then G contains a cycle of length at least min{n, 2δ}. In this paper, we consider the problem of determining the number of different odd or even cycle lengths that must exist under the minimum degree condition. We conjecture that there are δ − 1 even cycles of different lengths, and when G is...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملOn some generalisations of Brown's conjecture
Let $P$ be a complex polynomial of the form $P(z)=zdisplaystyleprod_{k=1}^{n-1}(z-z_{k})$,where $|z_k|ge 1,1le kle n-1$ then $ P^prime(z)ne 0$. If $|z|
متن کامل